#include <CGAL/HalfedgeDS_default.h>
#include <CGAL/HalfedgeDS_decorator.h>
struct Traits { typedef int Point_2; };
typedef CGAL::HalfedgeDS_default<Traits> HDS;
typedef CGAL::HalfedgeDS_decorator<HDS> Decorator;

/*
3.1
The Default Halfedge Data Structure

The following example program uses the default halfedge data structure and the decorator class.
The default halfedge data structure uses a list-based representation. 
All incidences of the items and a point type for vertices are defined. 
The trivial traits class provides the type used for the point. 
The program creates a loop, consisting of two halfedges, one vertex and two faces, and checks its validity.
*/
void main_3_1() {
	HDS hds;
	Decorator decorator(hds);
	decorator.create_loop();
	CGAL_assertion(decorator.is_valid());
}


int main()
{
	return 0;
}